The minimal dominant set is a non-empty core-extension

نویسندگان

  • László Á. Kóczy
  • Luc Lauwers
چکیده

A TU-game in characteristic function form generates a unique minimal dominant set. This set is non-empty. For a game with a non-empty core, the core and the minimal dominant set coincide; in this case the core is the smallest (for inclusion) set of outcomes that satisfies accessibility. For an abstract game, the minimal dominant set and Shenoy’s dynamic solution coincide.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accessible outcomes versus absorbing outcomes

Kóczy and Lauwers (2004, 2007) show that the collection of absorbing outcomes, i.e., the coalition structure core, of a TU game, if non-empty, is a minimal dominant set. The paper complements the result in two respects. First, it is shown that the coalition structure core, if non-empty, can be reached from any outcome via a sequence of successive blocks in quadratic time. Second, we observe tha...

متن کامل

All Ramsey (2K2,C4)−Minimal Graphs

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

متن کامل

Historic set carries full hausdorff dimension

‎We prove that the historic set for ratio‎ ‎of Birkhoff average is either empty or full of Hausdorff dimension in a class of one dimensional‎ ‎non-uniformly hyperbolic dynamical systems.

متن کامل

Cooperative oligopoly games with boundedly rational firms

We analyze cooperative Cournot games with externalities. Due to cognitive constraints, the members of a coalition cannot accurately predict the coalitional actions of the non-members. Thus, they compute their value following simple heuristics. In particular, they assign various non-equilibrium probability distributions over the outsiders’ set of partitions. We construct the value function of a ...

متن کامل

Optimal Design of Sandwich Panels Using Multi-Objective Genetic Algorithm and Finite Element Method

Low weight and high load capacity are remarkable advantages of sandwich panels with corrugated core, which make them more considerable by engineering structure designers. It’s important to consider the limitations such as yielding and buckling as design constraints for optimal design of these panels. In this paper, multi-objective optimization of sandwich panels with corrugated core is carried ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2007